Mechanizing structural induction part I: Formal system
نویسندگان
چکیده
منابع مشابه
Strategies for Mechanizing Structural Induction
A t heo rem p r o v i n g sys tem has been programmed f o r a u t o m a t i n g m i l d l y complex p r o o f s b y s t r u c t u r a l i n d u c t i o n . One pu rpose was t o p r o v e p r o p e r t i e s o f s i m p l e f u n c t i o n a l p rograms w i t h o u t l o o p s o r a s s i g n m e n t s . One can see t h e f o r m a l sys tem as a g e n e r a l i z a t i o n o f number t h e ...
متن کاملMechanizing Induction
In this chapter we will deal with “mechanizing” induction, i.e. with ways in which theoretical computer science approaches inductive generalization. In the field of Machine Learning, algorithms for induction are developed. Depending on the form of the available data, the nature of these algorithms may be very different. Some of them combine geometric and statistical ideas, while others use clas...
متن کاملMechanizing Formal Methods: Opportunities and Challenges
Mechanization makes it feasible to calculate properties of formally speciied systems. This ability creates new opportunities for using formal methods as an exploratory tool in system design. Achieving enough eeciency to make this practical raises challenging problems in automated deduction. These challenges can be met only by approaches that integrate consideration of its mechanization into the...
متن کاملA Review of Application of Signal Processing Techniques for Fault Diagnosis of Induction Motors – Part I
Abstract - Use of efficient signal processing tools (SPTs) to extract proper indices for fault detection in induction motors (IMs) is the essential part of any fault recognition procedure. The Part1 of the two parts paper focuses on Fourier-based techniques including fast Fourier transform and short time Fourier transform. In this paper, all utilized SPTs which have been employed for fault fete...
متن کاملFormal Mathematical Systems including a Structural Induction Principle
This study provides a general frame for the generation of languages in recursive systems closely related to formal grammars, for the predicate calculus and a constructive induction principle. We introduce recursive systems generating the recursively enumerable relations between lists of terms, the basic objects under consideration. A recursive system consists of axioms which are special quantif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1979
ISSN: 0304-3975
DOI: 10.1016/0304-3975(79)90034-3